Knuth - Bendix Completion with Modern Termination Checking
نویسنده
چکیده
KNUTH-BENDIX COMPLETION WITH MODERN TERMINATION CHECKING
منابع مشابه
Knuth-Bendix completion of theories of commuting group endomorphisms
Knuth-Bendix completions of the equational theories of k ≥ 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This improves on modern implementations of completion, where the orderings implemented cannot orient the commutation rules. The result has applications in decision procedures for automated verification.
متن کاملKnuth-Bendix Completion with a Termination Checker
Knuth-Bendix completion takes as input a set of universal equations and attempts to generate a convergent rewriting system with the same equational theory. An essential parameter is a reduction order used at runtime to ensure termination of intermediate rewriting systems. Any reduction order can be used in principle, but modern completion tools typically implement only a few classes of such ord...
متن کاملKnuth-Bendix Completion with Modern Termination Checking, Master's Thesis, August 2006
Knuth-Bendix completion is a technique for equational automated theorem proving based on term rewriting. This classic procedure is parametrized by an equational theory and a (well-founded) reduction order used at runtime to ensure termination of intermediate rewriting systems. Any reduction order can be used in principle, but modern completion tools typically implement only a few classes of suc...
متن کاملSlothrop: Knuth-Bendix Completion with a Modern Termination Checker
A Knuth-Bendix completion procedure is parametrized by a reduction ordering used to ensure termination of intermediate and resulting rewriting systems. While in principle any reduction ordering can be used, modern completion tools typically implement only Knuth-Bendix and path orderings. Consequently, the theories for which completion can possibly yield a decision procedure are limited to those...
متن کاملKBCV - Knuth-Bendix Completion Visualizer
This paper describes a tool for Knuth-Bendix completion. In its interactive mode the user only has to select the orientation of equations into rewrite rules; all other computations (including necessary termination checks) are performed internally. Apart from the interactive mode, the tool also provides a fully automatic mode. Moreover, the generation of (dis)proofs in equational logic is suppor...
متن کامل